Program Models for Compositional Verification
نویسندگان
چکیده
منابع مشابه
Compositional Verification of Architectural Models
This paper describes a design flow and supporting tools to significantly improve the design and verification of complex cyber-physical systems. We focus on system architecture models composed from libraries of components and complexity-reducing design patterns having formally verified properties. This allows new system designs to be developed rapidly using patterns that have been shown to reduc...
متن کاملCompositional Verification of Relaxed-Memory Program Transformations
is paper is about verifying program transformations on an axiomatic relaxed memory model of the kind used in C/C++ and Java. Relaxed models present particular challenges for verifying program transformations, because they generate many additional modes of interaction between code and context. For a block of code being transformed, we dene a denotation from its behaviour in a set of representa...
متن کاملCompositional Specification and Verification of UML Models ∗
Today, UML 2.0 [3] is an accepted modeling language for object-oriented software systems. It provides a range of diagrammatic notations for modeling and specifying different aspects of a system’s structure and behavior. Quite a lot of methods and tools are developed to enable the formal analysis of these models. But most of these methods are concerned with a particular implementation of the mod...
متن کاملContracts for BIP: Hierarchical Interaction Models for Compositional Verification
This paper presents an extension of the BIP component framework to hierarchical components by considering also port sets of atomic components to be structured (ports may be in conflict or ordered, where a larger port represents an interaction set with larger interactions). A composed component consisting of a set of components connected through BIP connectors and a set of ports representing a s...
متن کاملDecomposition for compositional verification
Compositional verification is based on the idea that the correctness check of a complex system can be divided into smaller verification tasks for its components. In this paper, we show how to decompose a specification into components when either no such decomposition is given, or when the given composition does not lend itself to an efficient compositional verification. Our decomposition is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.304.0.1